竞争性假设分析法在群体性事件情报预警中的应用

目前，边防部门对于群体性事件预警情报的分析缺乏科学系统的工作流程和分析思路，受思维定势、先入为主等主观因素的影响较为严重。随着科学技术的不断发展，群体性事件预警情报的来源不断扩展，数量不断攀升，如何进行准确的情报分析，成为边防部门面临的一个亟待解决的问题。分析了竞争性假设分析法在群体性事件情报预警中的可行性和实际应用，对预警情报的分析工作有一定的借鉴价值。     

基于马尔可夫过程的坦克火力随机对抗模型

根据小规模坦克火力对抗中所具有的马尔可夫性特点,将该过程视为离散状态、离散时间的马尔可夫随机过程(马尔可夫链),由此建立了坦克与反坦克武器系统之间一对一对抗的随机格斗模型,并给出双方获胜概率和平均对抗回合数的计算公式。最后通过实例验证了模型的有效性。该模型克服了轮流对抗不符合战场实际的缺点,为分队指挥员在射击策略的选择和分队火力运用上的快速决策提供了较为精确的量化依据。     

一类完全非线性函数的证明与计数

Helleseth等最近给出了一类二项式形式的完全非线性函数,这是至今为止所发现的第一类由两个互不等价的单项式组成的二项式形式的完全非线性函数。本文利用Frobinus自同构将其变形为一个新的二项式,给出了其完全非线性的简洁证明,指出了这类函数与x2是等价的,最后讨论了该类完全非线性函数的计数性质。     

On finding spanning eulerian subgraphs

In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas.     

Approximation for the departure process of a queue in a network

A simple renewal process is identified to approximate the complex departure process of a queue often found in queueing network models. The arrival process to the queue is the superposition or merging of several independent component-renewal processes that are approximations of departure processes from other queues and external arrival processes; there is a single server with exponential service times, and the waiting space is infinite. The departure process of this queue is of interest because it is the arrival process to other queues in the network. The approximation proposed is a hybrid; the mean and variance of the approximating departure intervals is a weighted average of those determined by basic methods in Whitt [41] with the weighting function empirically determined using simulation. Tandem queueing systems with superposition arrival processes and exponential service times are used to evaluate the approximation. The departure process of the first queue in the tandem is approximated by a renewal process, the tandem system is replaced by two independent queues, and the second queue is solved analytically. When compared to simulation estimates, the average absolute error in hybrid approximations of the expected number in the second queue is 6%, a significant improvement over 22–41% in the basic methods.     

Minimizing mean absolute deviation of completion times about a common due date

We consider a single machine scheduling problem in which the objective is to minimize the mean absolute deviation of job completion times about a common due date. We present an algorithm for determining multiple optimal schedules under restrictive assumptions about the due date, and an implicit enumeration procedure when the assumptions do not hold. We also establish the similarity of this problem to the two parallel machines mean flow time problem.